Augmenting Undirected Edge Connectivity in Õ(n2) Time
نویسندگان
چکیده
منابع مشابه
Augmenting Undirected Edge Connectivity in Õ(n2) Time
We give improved randomized (Monte Carlo) algorithms for undirected edge splitting and edge connectivity augmentation problems. Our algorithms run in time ~ O(n2) on n-vertex graphs, making them an ~ (m=n) factor faster than the best known deterministic ones on m-edge graphs.
متن کاملAugmenting undirected node-connectivity by one
We present a min-max formula for the problem of augmenting the nodeconnectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum cost version for node-induced cost functions.
متن کاملEdge-connectivity of undirected and directed hypergraphs
The objective of the thesis is to discuss edge-connectivity and related connectivity conceptsin the context of undirected and directed hypergraphs. In particular, we focus on k-edge-connectivity and (k, l)-partition-connectivity of hypergraphs, and (k, l)-edge-connectivityof directed hypergraphs. A strong emphasis is placed on the role of submodularity in thestructural aspects o...
متن کاملAugmenting undirected connectivity in RNC and in randomized ~ O ( n 3 ) time
In the edge connectivity augmentation problem one wants to find an edge set of minimum total capacity so that if one adds it to the input graph, the maxflow value is at least k between each pair of nodes. In this paper we present the first RNC algorithm to solve this problem. The sequential version of our algorithm has running time ~ O(minfn3; n2g) for undirected graphs with integer capacities,...
متن کاملAugmenting Graphs to Meet Edge-Connectivity Requirements
Andrds Frank Research Institute for Discrete Mathematics, Institute for Operations Research, University of Bonn, West Germany and Department of Computer Science, Eiitviis University, Hungary. What is the minimum number 7 of edges to be added to a given graph G so that in the resulting graph the edge-connectivity between every pair {U, U} of nodes is at least a prescribed value T(U, v)? Generali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2000
ISSN: 0196-6774
DOI: 10.1006/jagm.2000.1093